Dynamic Bandwidth Allocation Using Infinitesimal Perturbation Analysis
نویسندگان
چکیده
Advances in network management and switching technologies make dynamic bandwidth allocation of logical networks built on top of a physical network possible. Previous proposed dynamic bandwidth allocation algorithms are based on simplified network model. The analytical model is valid only under restrictive assumptions. Infinitesimal Perturbation Analysis, a technique which estimates the gradients of the functions in discrete event dynamic systems by passively observing the system, is used to estimate delay sensitivities under general traffic patterns. A new dynamic bandwidth allocation algorithm using on-line sensitivity estimation is proposed. Simulation results show that the approach further improves network performance. Implementation of the proposed algorithm in operational networks is also discussed.
منابع مشابه
Perturbation Analysis for Stochastic Fluid Queueing Systems
Recent study for congestion control in high speed networks indicates that the derivative information for the congestion at the common buffer for multiple sources could be useful in achieving efficient and fair allocation of the bandwidth (Kelly 1997, 1998). In this paper we present an algorithm that estimates such derivatives for multiple on-off sources. The algorithm has its root in the infini...
متن کاملOptimal Resource Allocation in Satellite Networks: Certainty Equivalent Approach versus Sensitivity Estimation Algorithms
in this paper we consider a resource allocation problem for a satellite network, where variations of fading conditions are added to those of traffic load. Since the capacity of the system is finite and divided in finite portions, the resource allocation problem reveals to be a discrete stochastic programming problem one, which is typically NP-Hard. We propose a new approach based on the minimiz...
متن کاملAn Infinitesimal Perturbation Analysis Algorithm for a Multiclass G/G/1 Queue*
It has been shown that infinitesimal perturbation analysis (IPA) provides very efficient algorithms for estimating derivatives in a broad class of discrete event dynamic systems (DEDS). But in its simple form, it fails in most multiclass DEDS. In this paper, we propose a revised IPA for a multiclass G/G/1 queue.
متن کاملAugmented infinitesimal perturbation analysis: An alternate explanation
Augmented infinitesimalperturbation analysis (APA) was introduced by GaJvoronski [ 1991] to increase the purview of the theory of Infinitesimal Perturbation Analysis (IPA). In reference [Gaivoronski 1991] it is shown that an unbiased estimate for the gradient of a class of performance measures of DEDS represented by generalized semi-Markov processes (GSMPs) (cf. [Glynn 1989] can be expressed as...
متن کاملOptimal scheduling of parallel queues using stochastic flow models
We consider a classic scheduling problem for optimally allocating a resource to multiple competing users and place it in the framework of Stochastic Flow Models (SFMs). We derive Infinitesimal Perturbation Analysis (IPA) gradient estimators for the average holding cost with respect to resource allocation parameters. These estimators are easily obtained from a sample path of the system without a...
متن کامل